Density Peak Clustering Algorithm Considering Topological Features
نویسندگان
چکیده
منابع مشابه
DenPEHC: Density peak based efficient hierarchical clustering
Existing hierarchical clustering algorithms involve a flat clustering component and an additional agglomerative or divisive procedure. This paper presents a density peak based hierarchical clustering method (DenPEHC), which directly generates clusters on each possible clustering layer, and introduces a grid granulation framework to enable DenPEHC to cluster large-scale and high-dimensional (LSH...
متن کاملGrid Density Clustering Algorithm
Data mining is the method of finding the useful information in huge data repositories. Clustering is the significant task of the data mining. It is an unsupervised learning task. Similar data items are grouped together to form clusters. These days the clustering plays a major role in every day-to-day application. In this paper, the field of KDD i.e. Knowledge Discovery in Databases, Data mining...
متن کاملImprovement of density-based clustering algorithm using modifying the density definitions and input parameter
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically i...
متن کاملImproved Fruit Fly Optimization Algorithm-based Density Peak Clustering and Its Applications
Original scientific paper As density-based algorithm, Density Peak Clustering (DPC) algorithm has superiority of clustering by finding the density peaks. But the cut-off distance and clustering centres had to be set at random, which would influence clustering outcomes. Fruit flies find the best food by local searching and global searching. The food found was the parameter extreme value calculat...
متن کاملPTS: Projected Topological Stream clustering algorithm
High-dimensional data streams clustering is an attractive research topic, as there are several applications that generate a high number of attributes, bringing new challenges in terms of partitioning due to the curse of dimensionality. In addition, those applications produce unbounded sequences of data which cannot be stored for later analysis. Although the importance of this scenario, there ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9030459